Representation results for defeasible logic

The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but efficient formalism for nonmonotonic reasoning based on rules and priorities. The transformations described in this paper have two main benefits: on one hand they can be used as a theoretical tool that leads to a deeper understanding of the formalism, and on the other hand they have been used in the development of an efficient implementation of defeasible logic.Comment: 30 pages, 1 figur

Embedding Defeasible Logic into Logic Programming

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.Comment: To appear in Theory and Practice of Logic Programmin

Completing Queries: Rewriting of IncompleteWeb Queries under Schema Constraints

Reactive Web systems, Web services, and Web-based publish/ subscribe systems communicate events as XML messages, and in many cases require composite event detection: it is not sufficient to react to single event messages, but events have to be considered in relation to other events that are received over time. Emphasizing language design and formal semantics, we describe the rule-based query language XChangeEQ for detecting composite events. XChangeEQ is designed to completely cover and integrate the four complementary querying dimensions: event data, event composition, temporal relationships, and event accumulation. Semantics are provided as model and fixpoint theories; while this is an established approach for rule languages, it has not been applied for event queries before

Non-trivial stably free modules over crossed products

We consider the class of crossed products of noetherian domains with universal enveloping algebras of Lie algebras. For algebras from this class we give a sufficient condition for the existence of projective non-free modules. This class includes Weyl algebras and universal envelopings of Lie algebras, for which this question, known as noncommutative Serre's problem, was extensively studied before. It turns out that the method of lifting of non-trivial stably free modules from simple Ore extensions can be applied to crossed products after an appropriate choice of filtration. The motivating examples of crossed products are provided by the class of RIT algebras, originating in non-equilibrium physics.Comment: 13 page

Critical Opalescence in Baryonic QCD Matter

We show that critical opalescence, a clear signature of second-order phase transition in conventional matter, manifests itself as critical intermittency in QCD matter produced in experiments with nuclei. This behaviour is revealed in transverse momentum spectra as a pattern of power laws in factorial moments, to all orders, associated with baryon production. This phenomenon together with a similar effect in the isoscalar sector of pions (sigma mode) provide us with a set of observables associated with the search for the QCD critical point in experiments with nuclei at high energies.Comment: 7 pages, 1 figur

Criticality, Fractality and Intermittency in Strong Interactions

Assuming a second-order phase transition for the hadronization process, we attempt to associate intermittency patterns in high-energy hadronic collisions to fractal structures in configuration space and corresponding intermittency indices to the isothermal critical exponent at the transition temperature. In this approach, the most general multidimensional intermittency pattern, associated to a second-order phase transition of the strongly interacting system, is determined, and its relevance to present and future experiments is discussed.Comment: 15 pages + 2 figures (available on request), CERN-TH.6990/93, UA/NPPS-5-9